\hypertarget{binarytreenode__test_8h}{}\section{src/tree\+\_\+algorithms/binarytreenode/binarytreenode\+\_\+test.h File Reference}
\label{binarytreenode__test_8h}\index{src/tree\+\_\+algorithms/binarytreenode/binarytreenode\+\_\+test.\+h@{src/tree\+\_\+algorithms/binarytreenode/binarytreenode\+\_\+test.\+h}}
{\ttfamily \#include \char`\"{}src/google\+\_\+test/gtest.\+h\char`\"{}}\\*
{\ttfamily \#include \char`\"{}binarytreenode.\+h\char`\"{}}\\*
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \hyperlink{class_binary_tree_node_test}{Binary\+Tree\+Node\+Test}
\begin{DoxyCompactList}\small\item\em \hyperlink{class_binary_tree_node_test}{Binary\+Tree\+Node\+Test}\+:测试类，用于为测试提供基础数据 \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
\hyperlink{binarytreenode__test_8h_a5e60721fa0b0b3e063e4deeb6d6adde4}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_binary_tree_node_test}{Binary\+Tree\+Node\+Test}, test\+\_\+default\+\_\+node)
\begin{DoxyCompactList}\small\item\em binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 \end{DoxyCompactList}\item 
\hyperlink{binarytreenode__test_8h_a47c27eb6ebf09ff66a60171c8595d2be}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_binary_tree_node_test}{Binary\+Tree\+Node\+Test}, test\+\_\+to\+\_\+string)
\begin{DoxyCompactList}\small\item\em binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 \end{DoxyCompactList}\item 
\hyperlink{binarytreenode__test_8h_ab52f5722d4b86ec248400222aca3088b}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_binary_tree_node_test}{Binary\+Tree\+Node\+Test}, test\+\_\+to\+\_\+xml)
\begin{DoxyCompactList}\small\item\em binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 \end{DoxyCompactList}\item 
\hyperlink{binarytreenode__test_8h_a28341da48ac03f4c9840714ab356c7c9}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_binary_tree_node_test}{Binary\+Tree\+Node\+Test}, test\+\_\+is\+\_\+left\+\_\+child)
\begin{DoxyCompactList}\small\item\em binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 \end{DoxyCompactList}\item 
\hyperlink{binarytreenode__test_8h_a521f0066be61aeadfe17bbf7dec7855f}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_binary_tree_node_test}{Binary\+Tree\+Node\+Test}, test\+\_\+is\+\_\+right\+\_\+child)
\begin{DoxyCompactList}\small\item\em binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Function Documentation}
\hypertarget{binarytreenode__test_8h_a5e60721fa0b0b3e063e4deeb6d6adde4}{}\index{binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Binary\+Tree\+Node\+Test, test\+\_\+default\+\_\+node)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Binary\+Tree\+Node\+Test}}]{, }
\item[{test\+\_\+default\+\_\+node}]{}
\end{DoxyParamCaption}
)}\label{binarytreenode__test_8h_a5e60721fa0b0b3e063e4deeb6d6adde4}


binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 

当创建默认节点时，节点应该满足的特征 

Definition at line 55 of file binarytreenode\+\_\+test.\+h.

\hypertarget{binarytreenode__test_8h_a47c27eb6ebf09ff66a60171c8595d2be}{}\index{binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Binary\+Tree\+Node\+Test, test\+\_\+to\+\_\+string)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Binary\+Tree\+Node\+Test}}]{, }
\item[{test\+\_\+to\+\_\+string}]{}
\end{DoxyParamCaption}
)}\label{binarytreenode__test_8h_a47c27eb6ebf09ff66a60171c8595d2be}


binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 

测试{\ttfamily to\+\_\+string()}方法正确执行 

Definition at line 67 of file binarytreenode\+\_\+test.\+h.

\hypertarget{binarytreenode__test_8h_ab52f5722d4b86ec248400222aca3088b}{}\index{binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Binary\+Tree\+Node\+Test, test\+\_\+to\+\_\+xml)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Binary\+Tree\+Node\+Test}}]{, }
\item[{test\+\_\+to\+\_\+xml}]{}
\end{DoxyParamCaption}
)}\label{binarytreenode__test_8h_ab52f5722d4b86ec248400222aca3088b}


binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 

测试{\ttfamily to\+\_\+xml()}方法正确执行 

Definition at line 77 of file binarytreenode\+\_\+test.\+h.

\hypertarget{binarytreenode__test_8h_a28341da48ac03f4c9840714ab356c7c9}{}\index{binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Binary\+Tree\+Node\+Test, test\+\_\+is\+\_\+left\+\_\+child)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Binary\+Tree\+Node\+Test}}]{, }
\item[{test\+\_\+is\+\_\+left\+\_\+child}]{}
\end{DoxyParamCaption}
)}\label{binarytreenode__test_8h_a28341da48ac03f4c9840714ab356c7c9}


binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 

测试 {\ttfamily is\+\_\+left\+\_\+child()}方法执行正确 

Definition at line 87 of file binarytreenode\+\_\+test.\+h.

\hypertarget{binarytreenode__test_8h_a521f0066be61aeadfe17bbf7dec7855f}{}\index{binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!binarytreenode\+\_\+test.\+h@{binarytreenode\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Binary\+Tree\+Node\+Test, test\+\_\+is\+\_\+right\+\_\+child)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Binary\+Tree\+Node\+Test}}]{, }
\item[{test\+\_\+is\+\_\+right\+\_\+child}]{}
\end{DoxyParamCaption}
)}\label{binarytreenode__test_8h_a521f0066be61aeadfe17bbf7dec7855f}


binary\+\_\+tree\+\_\+node\+\_\+test：测试二叉树节点 

测试 {\ttfamily is\+\_\+right\+\_\+child()}方法执行正确 

Definition at line 98 of file binarytreenode\+\_\+test.\+h.

